Weak Positivity and Dyson’s Lemma
نویسنده
چکیده
We give a proof of Dyson’s Lemma for a product of smooth projective varieties of arbitrary dimension.
منابع مشابه
Dyson’s Lemma and a Theorem of Esnault and Viehweg
In the classical theory of diophantine approximation, as encountered in the work of Thue, Siegel, Dyson, Roth, and Schmidt, finiteness results are obtained by constructing an auxilliary polynomial. One knows a priori that the polynomial vanishes to high order at certain approximating points and this contradicts an upper bound on the order of vanishing obtained by other techniques. The difficult...
متن کاملDyson’s lemma with moving parts
In its original form [D], Dyson’s Lemma bounds the order of vanishing of a polynomial in two variables at a finite set of points and was used in studying rational approximations to a fixed algebraic irrational number. Bombieri [B] revived interest in Dyson’s Lemma and subsequently Esnault and Viehweg [EV] and Vojta [V1] vastly extended the scope of the result, to polynomials in several variable...
متن کاملUnderstanding Dyson’s Lemma
In 1989, I proved a Dyson lemma for products of two smooth projective curves of arbitrary genus. In 1995, M. Nakamaye extended this to a result for a product of an arbitrary number of smooth projective curves of arbitrary genus, in a formulation involving an additional “perturbation divisor.” In 1998, he also found an example in which a hoped-for Dyson lemma is false without such a perturbation...
متن کاملTotal Positivity for Loop Groups Ii: Chevalley Generators
This is the second in a series of papers developing a theory of total positivity for loop groups. In this paper, we study infinite products of Chevalley generators. We show that the combinatorics of infinite reduced words underlies the theory, and develop the formalism of infinite sequences of braid moves, called a braid limit. We relate this to a partial order, called the limit weak order, on ...
متن کاملIntersection Theory and Diophantine Approximation
A keystone in the classical theory of diophantine approximation is the construction of an auxilliary polynomial. The polynomial is constructed so that it is forced (for arithmetic reasons) to vanish at certain approximating points and this contradicts an upper bound on the order of vanishing obtained by other (usually geometric) techniques; the contradiction then allows one to prove finiteness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008